Some Improved Bounds on Small Strong -Nets
نویسندگان
چکیده
In this paper we present some new constructions of small strong -nets for rectangles, strips and wedges based on simple geometric arguments. For rectangular range spaces we improve upon the earlier known bound on for net set size of 2. For strips and wedges for which only lower bounds were known, we bound from above for net set sizes of 2, 3 and 4. Further, we show that the net constructed for strips are also nets for wedges for net size of 3 and 4.
منابع مشابه
Througput Lower Bounds for Markovian Petri Nets: Transformation Techniques
This paper addresses the computation of lower bounds for the steady-state throughput of stochas-tic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by con...
متن کاملSmall strong epsilon nets
Let P be a set of n points in R. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than dn d+1 points of P . We call a point x a strong centerpoint for a family of objects C if x ∈ P is contained in every object C ∈ C that contains more than a constant fraction of points of P . A strong centerpoint does not exist even for halfspaces in R. We ...
متن کاملTighter Estimates for epsilon-nets for Disks
The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a smallsized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [5] made an important connection of this problem to the size of fundamental combinatorial structures called -nets, s...
متن کاملSmall-Size Relative (p,Epsilon)-Approximations for Well-Behaved Range Spaces
We present improved upper bounds for the size of relative (p, ε)-approximation for range spaces withthe following property: For any (finite) range space projected onto (that is, restricted to) a ground set ofsize n and for any parameter 1 ≤ k ≤ n, the number of ranges of size at most k is only nearly-linearin n and polynomial in k. Such range spaces are called “well behaved”. Ou...
متن کاملStronger generalization bounds for deep nets via a compression approach
Deep nets generalize well despite having more parameters than the number of training samples. Recent works try to give an explanation using PAC-Bayes and Margin-based analyses, but do not as yet result in sample complexity bounds better than naive parameter counting. The current paper shows generalization bounds that’re orders of magnitude better in practice. These rely upon new succinct repara...
متن کامل